Improved Decoding of Circuit Noise and Fragile Boundaries of Tailored Surface Codes
نویسندگان
چکیده
Realizing the full potential of quantum computation requires error correction (QEC), with most recent breakthrough demonstrations QEC using surface code. codes use multiple noisy physical qubits to encode information in fewer logical qubits, enabling identification errors through a decoding process. This process increases fidelity (or accuracy) making more reliable. However, fast (efficient run-time) decoders neglect important noise characteristics, thereby reducing their accuracy. In this work, we introduce that are both and accurate, can be used wide class including Our decoders, named belief-matching belief-find, exploit all unlock higher accuracy QEC. Using code threshold as performance metric, observe at 0.94% probability for our outperforming 0.82% standard minimum-weight perfect matching decoder. We also test theoretical case study tailored biased model. find lead much lower qubit overhead respect standard, square Surprisingly, well-below-threshold regime, rectangular becomes resource efficient than due previously unnoticed phenomenon call “fragile boundaries.” outperform other terms accuracy, better results current quantum-error-correction experiments opening up new areas studies.12 MoreReceived 8 June 2022Revised 5 2023Accepted 12 2023DOI:https://doi.org/10.1103/PhysRevX.13.031007Published by American Physical Society under Creative Commons Attribution 4.0 International license. Further distribution work must maintain attribution author(s) published article’s title, journal citation, DOI.Published SocietyPhysics Subject Headings (PhySH)Research AreasQuantum correctionSurface computingQuantum Information
منابع مشابه
Improved Decoding of Interleaved AG Codes
We analyze a generalization of a recent algorithm of Bleichenbacher et al. for decoding interleaved codes on the Q-ary symmetric channel for large Q. We will show that for any m and any the new algorithms can decode up to a fraction of at least βm βm+1 (1−R−2Q−1/2m)− errors, where β = ln(qm−1) ln(qm) , and that the error probability of the decoder is upper bounded by O(1/q ), where n is the blo...
متن کاملImproved decoding of affine–variety codes
We provide a decoding technique for affine-variety codes using a multidimensional extension of general error locator polynomials. We prove the existence of such polynomials for any affine-variety code and hence for any linear code. We compute some interesting cases, including Hermitian codes.
متن کاملImproved Decoding Algorithms for Reed-Solomon Codes
In coding theory, Reed-Solomon codes are one of the most well-known and widely used classes of error-correcting codes. In this thesis we study and compare two major strategies known for their decoding procedure, the Peterson-Gorenstein-Zierler (PGZ) and the Berlekamp-Massey (BM) decoder, in order to improve existing decoding algorithms and propose faster new ones. In particular we study a modif...
متن کاملImproved Decoding and Error Floor Analysis of Staircase Codes
Staircase codes play an important role as error-correcting codes in optical communications. In this paper, a low-complexity method for resolving stall patterns when decoding staircase codes is described. Stall patterns are the dominating contributor to the error floor in the original decoding method. Our improvement is based on locating stall patterns by intersecting non-zero syndromes and flip...
متن کاملImproved decoding of Reed-Solomon and algebraic-geometry codes
Given an error-correcting code over strings of length n and an arbitrary input string also of length n, the list decoding problem is that of finding all codewords within a specified Hamming distance from the input string. We present an improved list decoding algorithm for decoding Reed-Solomon codes. The list decoding problem for Reed-Solomon codes reduces to the following “curve-fitting” probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review X
سال: 2023
ISSN: ['2160-3308']
DOI: https://doi.org/10.1103/physrevx.13.031007